Factorization of transformations over a local ring

Rigid Resolution of a Finitely Generated Module Over a Regular Local Ring

rigid resolution of a finitely generated module over a regular local ring

Single-factor lifting and factorization of polynomials over local fields

Let f (x) be a separable polynomial over a local field. The Montes algorithm computes certain approximations to the different irreducible factors of f (x), with strong arithmetic properties. In this paper, we develop an algorithm to improve any one of these approximations, till a prescribed precision is attained. The most natural application of this ‘‘single-factor lifting’’ routine is to combi...

On Skew Cyclic Codes over a Finite Ring

In this paper, we classify the skew cyclic codes over Fp + vF_p + v^2F_p, where p is a prime number and v^3 = v. Each skew cyclic code is a F_p+vF_p+v^2F_p-submodule of the (F_p+vF_p+v^2F_p)[x;alpha], where v^3 = v and alpha(v) = -v. Also, we give an explicit forms for the generator of these codes. Moreover, an algorithm of encoding and decoding for these codes is presented.

Strong Cleanness of the 2× 2 Matrix Ring over a General Local Ring

A ring R is called strongly clean if every element of R is the sum of a unit and an idempotent that commute with each other. A recent result of Borooah, Diesl and Dorsey [3] completely characterized the commutative local rings R for which Mn(R) is strongly clean. For a general local ring R and n > 1, however, it is unknown when the matrix ring Mn(R) is strongly clean. Here we completely determi...